Vertex domination of generalized Petersen graphs
نویسندگان
چکیده
منابع مشابه
On Power Domination of Generalized Petersen Graphs
The power dominating problem is a variation of the classical domination problem in graphs. Electricity company use phase measurement units (PMUs) to produce the measuring data of a system, and use these data to estimate states of the system. Because of the high cost of PMUs, minimizing the number of PMUs on a system is an important problem for electricity companies. This problem can be modeled ...
متن کاملTotal Domination number of Generalized Petersen Graphs
Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in this paper.
متن کاملDouble Total Domination on Generalized Petersen Graphs
A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G. In this paper, we study the DTDS of the generalized Petersen graphs. Mathematics Subject Classification: 05C35
متن کاملRoman domination number of Generalized Petersen Graphs P(n, 2)
A Roman domination function on a graph G = (V,E) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman domination function f is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G, denoted by...
متن کاملThe exact domination number of the generalized Petersen graphs
Let G = (V, E) be a graph. A subset S ⊆ V is a dominating set of G, if every vertex u ∈ V − S is dominated by some vertex v ∈ S. The domination number, denoted by γ(G), is the minimum cardinality of a dominating set. For the generalized Petersen graph G(n), Behzad et al. [A. Behzad, M. Behzad, C.E. Praeger, On the domination number of the generalized Petersen graphs, Discrete Mathematics 308 (2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.01.018